Extended Abstract: A Study of Red-Black SOR Parallelization Using Chapel, D and Go Languages
نویسنده
چکیده
Successive over-relaxation (SOR) is an important iterative solver for solving linear systems. We present parallel implementations of the red-black SOR method using three modern programming languages, namely Chapel, D and Go. We employ the SOR method for solving a 2D steady-state heat conduction problem. We discuss the optimizations incorporated and the features of these languages which are crucial for improving the program performance. Experiments have been performed using 2, 4, and 8 threads for a 4096×4096 square grid and performance results are compared with serial execution. The analysis of results provides important insights into the working of SOR method. These results have been published in a journal paper and both serial and parallel sourcecode in each of three languages have been made available to the public [1, 2]. We discuss the SOR algorithm and Chapel [3] specific details here and refer to [1] for other details.
منابع مشابه
A Study of Successive Over-relaxation (SOR) Method Parallelization Over Modern HPC Languages
Successive over-relaxation (SOR) is a computationally intensive, yet extremely important iterative solver for solving linear systems. Due to recent trends of exponential growth in amount of data generated and increasing problem sizes, serial platforms have proved to be insufficient in providing the required computational power. In this paper, we present parallel implementations of red-black SOR...
متن کاملA study of successive over-relaxation method parallelisation over modern HPC languages
Successive over-relaxation (SOR) is a computationally intensive, yet extremely important iterative solver for solving linear systems. Due to recent trends of exponential growth in amount of data generated and increasing problem sizes, serial platforms have proved to be insufficient in providing the required computational power. In this paper, we present parallel implementations of red-black SOR...
متن کاملParallel SOR Iterative Algorithms and Performance Evaluation on a Linux Cluster
The successive over-relaxation (SOR) how to quickly verify and generate a iterative method is an important solver for linear multicoloring ordering according to the given systems. In this paper, a parallel algorithm for the structure of a matrix or a grid. However, the red-black SOR method with domain decomposition is multi-color SOR method is parallel only within investigated. The parallel SOR...
متن کاملAcceleration of Five - point Red - Black Gauss - Seidelin Multigrid for Poisson Equation
A new relaxation analysis and two acceleration schemes are proposed for the ve-point Red-Black Gauss-Seidel smoothing in multigrid for solving two dimensional Poisson equation. For a multigrid V cycle, we discovered that under-relaxation is applicable to restriction half cycle and overrelaxation is applicable to interpolation half cycle. Numerical experiments using modi ed multigrid V cycle alg...
متن کاملHPF vs. SAC — A Case Study
This paper compares the functional programming language Sac to Hpf with respect to specificational elegance and runtime performance. A well-known benchmark, red-black SOR, serves as a case study. After presenting the Hpf reference implementation alternative Sac implementations are discussed. Eventually, performance figures show the ability to compile highly generic Sac specifications into machi...
متن کامل